A Proximal Bundle Method for Nonconvex Functions with Inexact Oracles
نویسندگان
چکیده
For a class of nonconvex nonsmooth functions, we consider the problem of computing an approximate critical point, in the case of inexact oracles. The latter means that only an inexact function value and an inexact subgradient are available, at any given point. We assume that the errors in function and subgradient evaluations are merely bounded, and in principle need not vanish in the limit. We examine the redistributed proximal bundle approach in this setting, and show that reasonable convergence properties are obtained. We further consider a battery of difficult nonsmooth nonconvex problems, made even more difficult by introducing noise in the oracle output. We verify that very satisfactory outcomes are obtained in our computational implementation of the inexact algorithm.
منابع مشابه
A proximal bundle method for nonsmooth nonconvex functions with inexact information
For a class of nonconvex nonsmooth functions, we consider the problem of computing an approximate critical point, in the case when only inexact information about the function and subgradient values is available. We assume that the errors in function and subgradient evaluations are merely bounded, and in principle need not vanish in the limit. We examine the redistributed proximal bundle approac...
متن کاملBundle Methods for Convex Minimization with Partially Inexact Oracles
Recently the proximal bundle method for minimizing a convex function has been extended to an inexact oracle that delivers function and subgradient values of unknown accuracy. We adapt this method to a partially inexact oracle that becomes exact only when an objective target level for a descent step is met. In Lagrangian relaxation, such oracles may save work by evaluating the dual function appr...
متن کاملInexactness in Bundle Methods for Locally Lipschitz Functions
We consider the problem of computing a critical point of a nonconvex locally Lipschitz function over a convex compact constraint set given an inexact oracle that provides an approximate function value and an approximate subgradient. We assume that the errors in function and subgradient evaluations are merely bounded, and in particular need not vanish in the limit. After some discussion on how t...
متن کاملConvex proximal bundle methods in depth: a unified analysis for inexact oracles
The last few years have seen the advent of a new generation of bundle methods, capable to handle inexact oracles, polluted by “noise”. Proving convergence of a bundle method is never simple and coping with inexact oracles substantially increases the technicalities. Besides, several variants exist to deal with noise, each one needing an ad hoc proof to show convergence. We state a synthetic conv...
متن کاملProximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
In this paper, we introduce a stochastic projected subgradient method for weakly convex (i.e., uniformly prox-regular) nonsmooth, nonconvex functions—a wide class of functions which includes the additive and convex composite classes. At a high-level, the method is an inexact proximal point iteration in which the strongly convex proximal subproblems are quickly solved with a specialized stochast...
متن کامل